Low Power IEEE 802.11n LDPC Decoder Hardware

نویسندگان

  • Merve Peyic
  • Hakan A. Baba
  • Ilker Hamzaoglu
  • Mehmet Keskinoz
چکیده

In this paper, we present a low power hybrid low-density-parity-check (LDPC) decoder hardware implementing layered min-sum decoding algorithm for IEEE 802.11n Wireless LAN Standard. The LDPC decoder hardware, which has 27 check node datapaths and 24x162 variable node memory, is implemented in Verilog HDL and verified to work correctly in a Xilinx Virtex II FPGA. For 648 block length and 1/2 code rate, on a Xilinx Virtex II FPGA, the LDPC decoder hardware implementation works at 83.5 MHz and it can process 60.68 Mbps. For 648 block length and 5/6 code rate, on a Xilinx Virtex II FPGA, the LDPC decoder hardware implementation works at 71.5 MHz and it can process 113.78 Mbps. The power consumption of the implementation on a Xilinx Virtex II FPGA is estimated as 2052 mW for 648 block length and 1/2 code rate and 1989 mW for 648 block length and 5/6 code rate using Xilinx XPower tool. In this paper, we propose two novel techniques, submatrix reordering and differential shifting, for reducing the power consumption of a LDPC decoder hardware. We applied glitch reduction, sub-matrix reordering and differential shifting techniques to our LDPC decoder hardware. These techniques do not affect the bit error rate (BER) of a LDPC decoder. For block length 648 and code rate 1/2, these three techniques together reduced the power consumption of the LDPC decoder hardware in total by 23.7% to 1,565.84 mW. For block length 648 and code rate 5/6, they together reduced the power consumption of the LDPC decoder hardware in total by 38.98% to 1,214.22 mW.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low Complexity Quasi-Cyclic LDPC Decoder Architecture for IEEE 802.11n

In this paper, we present a fully pipelined LDPC decoder for 802.11n standard that supports variable block sizes and multiple code rates. The proposed architecture utilizes features of Quasi-Cyclic LDPC codes and layered decoding to reduce memory bits and interconnection complexity through efficient utilization of permutation network for forward and backward interconnection routing. Permutation...

متن کامل

A Novel Approach to built an Area Efficient Architecture for Block LDPC Codes

Low Density Parity Checker (LDPC) decoder requires large amount of memory access which leads to high energy consumption. The amount of achievable memory bypassing depends on the decoding orders of the layers. The proposed decoder was implemented in TSMC 0.18m CMOS process. Experimental results show that for a LDPC decoder targeting IEEE 802.11n specification, the amount of memory access values ...

متن کامل

A Low Latency, Low-Power LDPC Decoder Design

A low latency, low power LDPC decoder design is presented in the paper. Partial-parallel check node processors are designed to reduce the decoding latency with moderate complexity; the parity check matrices of the LDPC codes are column-wise reordered to facilitate the parallel processing. Meanwhile, an efficient early stopping algorithm is proposed to stop the ‘undecodable’ words so that at lea...

متن کامل

AREA AND ENERGY EFFICIENT VLSI ARCHITECTURES FOR LOW-DENSITY PARITY-CHECK DECODERS USING AN ON-THE-FLY COMPUTATION A Dissertation by KIRAN

Area and Energy Efficient VLSI Architectures for Low -Density Parity-Check Decoders Using an On-the-Fly Computation. (December 2006) Kiran Kumar Gunnam, M.S., Texas A&M University Co-Chairs of Advisory Committee: Dr. Gwan Choi Dr. Scott Miller The VLSI implementation complexity of a low density parity check (LDPC) decoder is largely influenced by the interconnect and the storage requirements. T...

متن کامل

Strategies for High-Throughput FPGA-based QC-LDPC Decoder Architecture

We propose without loss of generality strategies to achieve a high-throughput FPGA-based architecture for a QCLDPC code based on a circulant-1 identity matrix construction. We present a novel representation of the parity-check matrix (PCM) providing a multi-fold throughput gain. Splitting of the node processing algorithm enables us to achieve pipelining of blocks and hence layers. By partitioni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008